Functional Programming with Dynamic Binding
نویسنده
چکیده
Dynamic binding is a runtime operation which looks up some names in some environments: examples are quote and eval in LISP or object-oriented message passing. We present a functional language, in the spirit of ML or Haskell, which supports dynamic binding. At the surface level, the language supports constructs such as extensible records, variants, extensible case selection, quoted terms, and can encode various forms of objects. The underlying execution model is a lambda-calculus with name-based (labels, keywords) parameter passing. The type system supports subtyping, through an extension of Hindley-Milner type inference with recursively constrained types. In : "Object Applications", ed. Dennis Tsichritzis, University of Geneva, Centre Universitaire d’Informatique, Aug. 1996. This project is supported by the Swiss Federal Government by the SNSF grant 20-40’592.94 (Object Integration) and the OFES grant 93.0144 for Esprit BRA project 9102 (COORDINATION) Functional Programming With Dynamic Binding
منابع مشابه
A Syntactic Theory of Dynamic Binding
Dynamic binding, which traditionally has always been associated with Lisp, is still semantically obscure to many. Even though most programming languages favour lexical scope, not only does dynamic binding remain an interesting and expressive programming technique in specialised circumstances, but also it is a key notion in formal semantics. This article presents a syntactic theory that enables ...
متن کاملA Syntactic Theory of Dynamic
Dynamic binding, which has always been associated with Lisp, is still semantically obscure to many. Although largely replaced by lexical scoping, not only does dynamic binding remain an interesting and expressive programming technique in specialised circumstances, but also it is a key notion in semantics. This paper presents a syntactic theory that enables the programmer to perform equational r...
متن کاملAn Experience in Morphe: Dynamic Binding in Part-Whole Graphs to Enhance Reusability
calls. In dynamic binding, free variables in a method obtain their values from the environment from which the method is called, rather from the environment in which the method is de ned [Abelson et al. 85]. Functional programming languages prefer static binding, an alternative approach where the de nition environment is used instead of the application environment in the evaluation of a method. ...
متن کاملStochastic Dynamic Programming with Markov Chains for Optimal Sustainable Control of the Forest Sector with Continuous Cover Forestry
We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995